Informatics Publishing Limited

T. Ravi Nayak ¹, Sake Pothalaiah ¹, K. Ashok Babu ¹

Affiliations
1 Sri Indu college of Engineering and Technology, Affiliated to JNTU, Hyderabad, Ibrahimpatnam, R.R. Dist.-501510, IN

Abstract

Mobile Ad hoc wireless NETworks (MANETs) that do not need any fixed infrastructure. They are characterized by dynamic topology due to node mobility, limited channel bandwidth, and limited battery power of nodes. The key challenge in the design of ad hoc networks is the development of dynamic routing protocols that can efficiently find routes between two communicating nodes. Thus, many ad hoc routing protocols have been proposed in recent years. All these routing protocols attempt to provide a high data packet delivery ratio and low routing control traffic at the same time. These routing protocols can be classified into three categories: proactive, reactive and hybrid routing protocols.

Keywords

Ad hoc, ZRP, DSDV, Zone Routing, AZRP.

Full Text

     

K. Ashok Babu ¹, Thota Sravanti ¹

Affiliations
1 Department of Electronics and Communication Engineering, Sri Indu College of Engineering and Technology, IN

Abstract

Error control codes have become a vital part of modern digital wireless systems, enabling reliable transmission to be achieved over noisy channels. Over the past decade, turbo codes have been widely considered to be the most powerful error control code of practical importance. In the same time scale, mixed voice/data networks have advanced further and the concept of global wireless networks and terrestrial links has emerged. Such networks present the challenge of optimizing error control codes for different channel types, and for the different qualities of service demanded by voice and data. OFDM has become a popular modulation method in high speed wireless communications. By partitioning a wideband fading channel into flat fading narrowband channel, OFDM is used to mitigate the detrimental effects of multi path fading using a simple one-tap equalizer. There is a growing need to quickly transmit information wirelessly and accurately. The end goal is to increase the system throughput while maintaining system performance under a desired bit error rate (BER).

Keywords

Orthogonal Frequency Division Multiplexing (OFDM), Impulsive Noise, Turbo Codes, Bit Error Rate (BER).

Full Text

     

S. Srikanth Reddy ¹, K. Ashok Babu ¹

Affiliations
1 Sri Indu College of Engineering & Technology (Affiliated to JNTU, Hyderabad) Ibrahimpatnam, Hyderabad, Andhra Pradesh-501510, IN

Abstract

This paper presents the design and implementation of a low-energy asynchronous logic topology using sense amplifier- based pass transistor logic (SAPTL). The SAPTL structure can realize very low energy computation by using low-leakage pass transistor networks at low supply voltages. The introduction of asynchronous operation in SAPTL further improves energy-delay performance without a significant increase in hardware complexity. We show two different self-timed approaches: 1) the bundled data and 2) the dual-rail handshaking protocol. The proposed self-timed SAPTL architectures provide robust and efficient asynchronous computation using a glitch-free protocol to avoid possible dynamic timing hazards. Simulation and measurement results show that the self-timed SAPTL with dual-rail protocol exhibits energy-delay characteristics better than synchronous and bundled data self-timed approaches in 180-nm, 120-nm CMOS The Pass transistor logic is a simple and compact circuit topology and in some cases, out performs static CMOS circuits. The pass transistor network itself does not have V_dd and ground connections, thus drastically reducing the number of leakage paths. In pass transistor logic (PTL), leakage is confined to the driving and level restoring circuitry associated with the PT network. These circuits are used to recover the voltage swing and delay degradation inherent in PTL circuits. A conventional PT network that implements logic functions based on multiplexer or binary decision diagram (BDD) tree structures. The main drawback of these structures is that sneak paths exists allowing leakage current to flow. PT networks can be made more complex, thus reducing the total number of drivers and level restorers in order reduce the number of leakage paths, but unfortunately, the number of sneak paths in the PT tree increases exponentially with the number of logic inputs. Note that the delay is also dependent on the number of levels and is proportional to N^2. PT also increases the effective channel length between the supply The dual-rail hand shaking protocol. The proposed self-timed SAPTL architectures provide robust and efficient asynchronous computation using a glitch-free protocol to avoid possible dynamic timing hazards. Simulation and measurement results show that the self-timed SAPTL with dual-rail protocol exhibits energy-delay characteristics better than synchronous and bundled data self-timed approaches.

Keywords

Pass Transistor, Self-Timing, Sense Amplifier-Based Pass Transistor Logic (SAPTL).

Full Text

     

Madhuri Devi ¹, K. Ashok Babu ², Sake Pothalaiah ³, Suresh Ballala ³

Affiliations
1 ECE Department, Sri Indu College of Engg., IN
2 Department in ECE, Sri Indu College of Engineering, IN
3 ECE Department, Sri Indu College of Engg, IN

Abstract

Data acquisition system is an embedded system, which collects the data at predefined time intervals from different sensors for different physical measurements like temperature, vibration, light, Voltage variations, etc. In fact, anything that you need to measure. In stand-alone data acquisition system, the output may be in the form of display, buzzer, memory storage devices etc. These devices placed in different locations are used to collect the data and, this data can be transmitted to centrally located PC servers, for further analysis and storage via different communication mediums TCP/IP. This can also be called as Remote Data acquisition system. The microcontroller based embedded device that collects the data from the sensors and transmit to remote PC server via modem .The main purpose of using IP, is to transfer the collected data from different locations and to overcome the limitation of serial communication. This data acquisition system consists of two parts Control unit and    Communication unit. The control unit is having one micro-controller interfaced with A to D converter, which converts analog signals to digital form. The microcontroller will be interfaced with modem and then the data is sent through LAN OR WAN.

Keywords

Embedded ARM, Remote I/O Data, Data Acquisition and Monitoring.

Full Text

     

M. Suresh Babu ¹, K. Ashok Babu ², G. Kesavan ³

Affiliations
1 Sri Indu College Of Engg., Hyd, AP, IN
2 Sri Indu College of Engg., Hyd, IN
3 Pricol Limited, Hyd, AP, IN

Abstract

This brief presents a novel very large-scale integration (VLSI) architecture for discrete wavelet packet transform (DWPT).By exploiting the in-place nature of the DWPT algorithm, this architecture has an efficient pipeline structure to implement high-throughput processing without any on-chip memory/first-in first out access. A folded architecture for lifting-based wavelet filters is proposed to compute the wavelet butterflies in different groups simultaneously at each decomposition level. According to the comparison results, the proposed VLSI architecture is more efficient than the previous proposed architectures in terms of memory access,hardware regularity and simplicity, and throughput. The folded architecture not only achieves a significant reduction in hardware cost but also maintains both the hardware utilization and high-throughput processing with comparison to the direct mapped tree structured architecture.

Keywords

Discrete Wavelet Packet Transform (DWPT), Lifting Scheme, Pipeline Architecture, Very Large-Scale Integration (VLSI).

Full Text

     

Sravani Alameti ¹, Sake Pothalaiah ¹, K. Ashok Babu ¹

Affiliations
1 Sri Indu College of Engineering and Technology (Affiliated to JNTU, Hyderabad) Ibrahimpatnam RR District-501510, IN

Abstract

Steganography is the art and science of writing hidden messages in such a way that no one, apart from the sender and intended recipient, suspects the existence of the message, a form of security through obscurity.  The advantage of steganography, over cryptography alone, is that messages do not attract attention to themselves.

Cryptography protects the contents of a message, steganography can be said to protect both messages and communicating parties. Wide ranges of algorithms have been introduced using text, audio, video and images files as covering media. This paper presents a new approach for steganography in Telugu texts. Taking the typical structure of Telugu alphabets into consideration, in this approach, by shifting inherent vowel signs either left or right, we hide the secret message. The approach shows good result on the sample collected from different Telugu newspaper.

Keywords

Information Security, Text Steganography, Information Hiding, Text Watermarking, Telugu Text Steganography.

Full Text

     

S. Swetha ¹, K. Ashok Babu ²

Affiliations
1 Sri Indu College of Engineering and Technology, IN
2 Department of Electronics, Sri Indu College of Engineering, JNTU University, Hyd, IN

Abstract

Image retrieval is a challenging task that requires efforts from image processing, link structure analysis, and web text retrieval. Since content-based image retrieval is still considered very difficult, most current large scale web image search engines exploit text and link structure to understand the content of the web images. However, local textual information, such as caption, filenames and adjacent text, is not always reliable and informative. And also, there is no commercial web image search engine support RF because of scalability, efficiency and effectiveness. Therefore, global texture information should be taken into account to support RF and a web image retrieval system makes relevance judgement. In this paper, we propose a re-ranking method to improve web image retrieval by reordering the images retrieved from an image search engine using RF. The re-ranking process should be applicable to any image search engines with little effort and experimental results on a database contain three million web images to show RF is effective.

Keywords

Image Retrieval, Relevance Feedback, Implicit Feedback, RF Fusion.

Full Text

     

T. Sudheer Kumar ¹, K. Ashok Babu ²

Affiliations
1 Sri Indu College of Engineering. & Technology (Affiliated to JNTU, Hyderabad) Ibrahimpatnam, Hyderabad, IN
2 Department (ECE), Sri Indu College of Engg & Technology, IN

Abstract

Analysis and interpretation of an image which was acquired by a non ideal imaging system is the key problem in many application areas. Existing methods to obtain blur invariants which are invariant with respect to centrally symmetric blur are based on geometric moments or complex moments.. In this paper, we propose an alternative approach. We derive the features for image representation which are invariant with respect to blur regardless of the degradation point spread function (PSF) provided that it is centrally symmetric. Methods to obtain blur invariants which are invariants with respect to centrally symmetric blur are based on geometric moments or complex moments, orthogonal Legendre moments. The performance of the proposed descriptors is evaluated with various point-spread functions and different image noises. The comparison of the different approaches with previous methods in terms of pattern recognition accuracy is also provided. The experimental results show that the proposed descriptors are more robust to noise and have better discriminative power than the methods based on geometric or complex moments.

Keywords

Blurred Image, Centrally Symmetric, Legendre Moments, Pattern Recognition, and Symmetric Blur.

Full Text

     

G. Bhavani ¹, K. Ashok Babu ²

Affiliations
1 Dept of ECE (Sub branch)-Digital Systems and Computer Electronics, Sheriguda Village, Ibrahimpatnam, RR-Dist, Andra Pradesh, IN
2 Sri Indu Collage of Engineering, IN

Abstract

An *arial image is the taking of photographs of the ground from an elevated position. The term usually refers to images in which the camera is not supported by a ground-based structure. Cameras may be hand held or mounted, and photographs may be taken by a photographer, triggered remotely or triggered automatically. Platforms for aerial photography include fixed-wing aircraft, helicopters, balloons, blimps and dirigibles, rockets, kites, poles, parachutes, vehicle mounted poles. Aerial photography should not be confused with Air-to-Air Photography, when aircraft serve both as a photo platform and subject.Recently we proposed a wavelet-based dynamic range compression algorithm to improve the visual quality of digital images captured in the high dynamic range scenes with non uniform lighting conditions. Image enhancement algorithm which provides dynamic range compression preserving the local contrast and tonal rendition is a very good candidate in aerial imagery applications such as image interpretation for defense and security tasks. This algorithm can further be applied to video streaming for aviation safety. In this project the latest version of the proposed algorithm which is able to enhance aerial images so that the enhanced images are better then direct human observation, is presented. The results obtained by applying the algorithm to numerous aerial images show strong robustness and high image quality.

Keywords

Aerial Imagery, Wavelet based Arthonormal Decomposition, Quality Enhancement.

Full Text

     

Sachin Pohar ¹, K. Ashok Babu ¹, G. Kesavan Pillai ²

Affiliations
1 Sri Indu College of Engg., Hyd, AP, IN
2 Pricol Limited, Hyd, AP, IN

Abstract

This paper proposes a high capacity reversible image watermarking scheme based on integer to integer wavelet transforms. The proposed scheme divides an input image into non-overlapping blocks and embeds a watermark into the high-frequency wavelet coefficients of each block. The conditions to avoid both underflow and overflow in the spatial domain are embedded includes not only messages but also side information used to reconstruct the exact original image. To minimize the mean squared distortion between the original and the watermarked images given a payload, the watermark is adaptively embedded into the image. The experimental results show that the proposed scheme achieves higher embedding capacity while maintaining distortion at a lower level than the existing reversible watermarking schemes.

Keywords

Reversible Watermarking, Wavelet Transform, Watermark Embedding and Extraction.

Full Text

     

K. Ashok Babu ¹, G. Kesavan Pillai ², Nalla Nandakishore ¹

Affiliations
1 Sri Indu College of Engg., Hyd, AP, IN
2 National Remote Sensing Agency, Hyd, AP, IN

Abstract

Single sensor digital color still/video cameras capture images using a color filter array (CFA) and require color interpolation (demosaicking) to reconstruct full color images. The color reproduction has to combat sensor noises which are channel dependent. If untreated in demosaicking, sensor noises can cause color artifacts that are hard to remove later by a separate Denoising process, because the demosaicking process complicates the noise characteristics by blending noises of different color channels. This paper presents a joint demosaicking-denoising approach to overcome this difficulty. The color image is restored from noisy mosaic data in two steps. First, the difference signals of color channels are estimated by linear minimum mean square-error estimation. This process exploits both spectral and spatial correlations to simultaneously suppress sensor noise and interpolation error. With the estimated difference signals, the full resolution green channel is recovered. The second step involves in a wavelet-based Denoising process to remove the CFA channel-dependent noises from the reconstructed green channel. The red and blue channels are subsequently recovered. Simulated and real CFA mosaic data are used to evaluate the performance of the proposed joint demosaicking-denoising scheme and compare it with many recently developed sophisticated demosaicking and denoising schemes.

Keywords

Bayer Pattern, Color Demosaicking, Color Filter Array (CFA), Denoising, Wavelet.

Full Text

     

V. Satish Kumar ¹, K. Ashok Babu ², S. Pothalaiah ¹

Affiliations
1 Department of Electronics & Communication Engineering, Sri Indu College of Engineering and Technology, Andhra Pradesh, IN
2 Department of Electronics & Communication Engineering, Sri Indu College of Engineering and Technology, Andhra Pradesh-10, IN

Abstract

Huge data system applications require storage of large volumes of data set, and the number of such applications is constantly increasing as the use of computers extends to new disciplines. At the same time, the proliferation of communication networks is resulting in massive transfer of data over communication links. Compressing data to be stored or transmitted reduces storage and communication costs. When the amount of data to be transmitted is reduced, the effect is that of increasing the capacity of the communication channel. Here efficient method for decoding the compressed data is proposed. This paper aims toward the implementation of a high speed Huffman decoding system. This proposed model enhances the speed of decoding operation. The model is implemented using VHDL language, simulated on Active HDL 5.1, synthesized, placed and routed and floorplaned using Xilinx tools.

Keywords

Decoder, Simulation, Huffman Decoder.

Full Text

     

B. Hemalatha ¹, K. Ashok Babu ¹, S. Pothalaiah ²

Affiliations
1 Department of Electronics and Communication Engineering, Sri Indu College of Engineering and Technology, IN
2 Department of Electronics and Communication Engineering, Sri Indu College of Engineering and Technology, IN

Abstract

This paper presents high speed butterfly architecture for circular convolution based on FNT using partial product multipliers. FNT is ideally suited to digital computation requiring the order of N log N additions, subtractions and bit shifts, but no multiplications. In addition to being efficient, the FNT implementation is exact with no round off errors. Binary arithmetic permits the exact computation of FNT. This technique involves arithmetic in a binary code corresponding to the simplest one of a set of code translations from the normal binary representation of each integer in the ring of integer. In the first stage normal binary numbers are converted into their diminished-1 representation using code conversion (CC). Then butterfly operation (BO) is carried out to perform FNT and IFNT where the point wise multiplication is performed using modulo 2n+1 partial product multipliers. Thus modulo 2n+1 additions are avoided in the final stages of FNT and IFNT and hence execution delay is reduced compared to circular convolution done with FFT and DFT. This architecture has better throughput and involves less hardware complexity.

Keywords

FNT, Code Conversion, Butterfly Operation, Diminished-1 Representation, Partial Product Multiplier.

Full Text

     

V. Satish Kumar ¹, K. Ashok Babu ², S. Pothalaiah ¹

Affiliations
1 Department of Electronics & Communication Engineering, Sri Indu College of Engineering and Technology, Andhra Pradesh, IN
2 Department of Electronics & Communication Engineering, Sri Indu College of Engineering and Technology, Andhra Pradesh-10, IN

Abstract

Huge data system applications require storage of large volumes of data set, and the number of such applications is constantly increasing as the use of computers extends to new disciplines. At the same time, the proliferation of communication networks is resulting in massive transfer of data over communication links. Compressing data to be stored or transmitted reduces storage and communication costs. When the amount of data to be transmitted is reduced, the effect is that of increasing the capacity of the communication channel. Here efficient method for decoding the compressed data is proposed. This paper aims toward the implementation of a high speed Huffman decoding system. This proposed model enhances the speed of decoding operation. The model is implemented using VHDL language, simulated on Active HDL 5.1, synthesized, placed and routed and floorplaned using Xilinx tools.

Keywords

Decoder, Simulation, Huffman Decoder.

Full Text

     

K. Ashok Babu , B. A. David , Swapna Medishetty

Abstract

This paper introduces a new implementation of wavelet packet decomposition which is combined with SPIHT (Set Partitioning in Hierarchical Trees) compression scheme. We provide the analysis of the problems arising from the application of zero tree quantization based algorithms (such as SPIHT) to wavelet packet transform coefficients. We established the generalized parent-child relationships for wavelet packets, providing complete tree structures for SPIHT. The proposed algorithm can be used for both wavelet dyadic and Wavelet Packet decomposition (WP-SPIHT). An extensive evaluation of the algorithm was performed and it has been shown that WP-SPIHT significantly outperforms base-line SPIHT coder for texture images. For these images the suboptimal WP cost-function enables good enough energy compaction that is efficiently exploited by the WP-SPIHT.

Keywords

Wavelet, Wavelet Packet, SPIHT, Image Codec.

Full Text

     

K. Venkatesh Sharma ¹, P. Mallesham ², K. Ashok Babu ³, S. Megha Chandrika ⁴

Affiliations
1 CSE Dept., Sri Indu College of Engg. & Tech., IN
2 Sri Indu College of Engg. & Tech., IN
3 ECE Dept., Sri Indu College of Engg. & Tech., IN
4 CSE Dept., Sri Indu Collg. of Engg. & Tech., IN

Abstract

We show that the e-commerce domain can provide all the right ingredients for successful data mining and claim that it is killer domain for data mining. We describe an integrated architecture based on our experience for supporting this integration. The architecture can dramatically reduce the pre-processing, cleaning and data understanding effort often documented to take 80% of the time in knowledge discovery projects. We emphasize the need for data collection at the application server layer (not the web server) in order to support logging of data and metadata that is essential to the discovery process. We describe the data transformation bridges required from the transaction processing systems and customer event streams (e. g. click streams) to the data warehouse. We detail the mining workbench, which needs to provide multiple views of the data through reporting, data mining algorithms, visualization and OLAP, We conclude with a set of challenges.

Keywords

Data Mining, E-Commerce, Session Zing, OLAP, Sniffers.

Full Text

     

D. Nagadevi ¹, K. Ashok Babu ²

Affiliations
1 Sri Indu College of Engineering Technology, Affiliated to JNTUH, Ibrahimpatnam, Hyderabad, Andhra Pradesh, IN
2 ECE Department, Sri Indu College of Engineering & Technology, Affiliated to JNTUH, Ibrahimpatnam, Hyderabad, Andhra Pradesh, IN

Abstract

Finding an empty car parking lot is always the problem for car drivers in large parking areas in places like mega shopping malls and stadiums during peak periods. A lot of time and energy are wasted to find an available car parking lot while entered into a car park space. In this system images are captured by a surveillance camera were processed to identify the occupancies of the parking lots. This occupancy information is further processed by a central control unit and distributed to display panels located at strategic locations at the parking areas.
This paper aims toward the implementation of a car parking guidance system with minimum cost because image processing technique is used rather than sensor-based technique. As surveillance cameras are readily available in most car parks, this technique is much cost effective than installing sensor on each parking lot.

Keywords

Car Parking Lots, Edge Detection, Image Processing, Image Acquisition, Object Detection.

Full Text

     

Madhavi Pagidimarry ¹, K. Ashok Babu ²

Affiliations
1 Sri Indu College of Engineering, HYD, AP, IN
2 Department of Electronics, Sri Indu College of Engineering, JNTU University, HYD, IN

Abstract

'Image Fusion' is the Information from multiple images which are combined to generate the new image, the generated image is more suitable for humans and machines for further image-processing tasks like image segmentation, edge detection, stereo matching, enhancement, extraction and recognition. Novel feature-level multi-focus image fusion technique is proposed in this paper, which fuses multi-focus images using classification. In this technique, Multi-focus images of ten pairs are divided into blocks and the most favourable block size for each image is found in an adaptive manner. The resultant block feature vectors are fed to feed towards neural network. The neural networks are trained in such a way that, the trained neural networks are used to fuse any pair of multi-focus images. The Proposed and Implemented technique used in this paper is more efficient and useful;to highlight the efficiency we have performed broad experimentation on this technique.

Keywords

Image Fusion, Features, Neural Networks, Block Size.

Full Text